Lyndon Christoffel digitally convex
نویسندگان
چکیده
منابع مشابه
Lyndon + Christoffel = digitally convex
Discrete geometry redefines notions borrowed from Euclidean geometry creating a need for new algorithmical tools. The notion of convexity does not translate trivially, and detecting if a discrete region of the plane is convex requires a deeper analysis. To the many different approaches of digital convexity, we propose the combinatorics on words point of view, unnoticed until recently in the pat...
متن کاملFinding maximum-weight consistent digitally convex regions
We describe an algorithm to find maximum-weight digitally convex regions in gray-scale images. After Christ et al. [CPS10] gave a system for consistent digital line systems, the question how to transfer the concept of convexity to digital regions naturally appeared. The regions computed using this definition are weight-maximal, the computational complexity of our algorithm amounts to O(n5 · log...
متن کاملAsymptotic Analysis and Random Sampling of Digitally Convex Polyominoes
Recent work of Brlek et al. gives a characterization of digitally convex polyominoes using combinatorics on words. From this work, we derive a combinatorial symbolic description of digitally convex polyominoes and use it to analyze their limit properties and build a uniform sampler. Experimentally, our sampler shows a limit shape for large digitally convex polyominoes. Introduction In discrete ...
متن کاملGenerating and Enumerating Digitally Convex Sets of Trees
Suppose V is a finite set and C a collection of subsets of V that contains ∅ and V and is closed under taking intersections. Then C is called a convexity and the ordered pair (V, C) is called an aligned space and the elements of C are referred to as convex sets. For a set S ⊆ V , the convex hull of S relative to C, denoted by CHC(S), is the smallest convex set containing S. A set S of vertices ...
متن کاملSudo-Lyndon
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2009
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2008.11.010